Verification of the Search Space Exploration Strategy Based on the Solutions of the Join Ordering Problem
نویسندگان
چکیده
The paper addresses the problem of quality estimation of the search space exploration strategy. The strategy is used to find a satisfying solution to the join ordering problem, which 46 D. Kostrzewa, H. Josiński constitutes a crucial part of the database query optimization task. The method of strategy verification is based on the comparison of the execution time for the solution produced by the IWO algorithm with the execution time for the solution determined by the SQL Server 2008 optimizer. The authors discuss representations of the single solution and describe the modified version of the IWO algorithm emphasizing features of the proposed hybrid method of the search space exploration. The results of the conducted experiments form the main topic of analysis.
منابع مشابه
Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملAdaptive Neuro-Fuzzy Inference System application for hydrothermal alteration mapping using ASTER data
The main problem associated with the traditional approach to image classification for the mapping of hydrothermal alteration is that materials not associated with hydrothermal alteration may be erroneously classified as hydrothermally altered due to the similar spectral properties of altered and unaltered minerals. The major objective of this paper is to investigate the potential of a neuro-fuz...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کامل